"Huffman coding" meaning in English

{
  "etymology_templates": [
    {
      "args": {
        "1": "its inventor",
        "2": "",
        "3": "",
        "4": "",
        "5": ""
      },
      "expansion": "its inventor",
      "name": "named-after/list"
    },
    {
      "args": {},
      "expansion": "|",
      "name": "!"
    },
    {
      "args": {
        "1": "en",
        "2": "David A. Huffman"
      },
      "expansion": "David A. Huffman",
      "name": "lang"
    },
    {
      "args": {
        "1": "en",
        "2": "David A. Huffman",
        "born": "1925",
        "died": "1999",
        "occ": "its inventor",
        "wplink": "="
      },
      "expansion": "Named after its inventor David A. Huffman (1925–1999)",
      "name": "named-after"
    }
  ],
  "etymology_text": "Named after its inventor David A. Huffman (1925–1999).",
  "forms": [
    {
      "form": "Huffman codings",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "Huffman coding (countable and uncountable, plural Huffman codings)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2018, Keshab K. Parhi, Takao Nishitami, editors, Digital Signal Processing for Multimedia Systems, CRC Press, →ISBN:",
          "text": "In Huffman coding, shorter code-words are assigned to more frequent symbols so that the average code-length is reduced.",
          "type": "quote"
        }
      ],
      "glosses": [
        "An entropy-encoding algorithm used for lossless data compression, involving a variable-length code table derived from the estimated probability of occurrence of each symbol (so that more frequent symbols take less space to store)."
      ],
      "hypernyms": [
        {
          "word": "prefix coding"
        }
      ],
      "id": "en-Huffman_coding-en-noun-o-J4pCV3",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "entropy",
          "entropy"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "lossless",
          "lossless"
        ],
        [
          "data compression",
          "data compression"
        ],
        [
          "code",
          "code"
        ],
        [
          "table",
          "table"
        ],
        [
          "probability",
          "probability"
        ]
      ],
      "raw_glosses": [
        "(computing theory) An entropy-encoding algorithm used for lossless data compression, involving a variable-length code table derived from the estimated probability of occurrence of each symbol (so that more frequent symbols take less space to store)."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "Huffman coding"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "its inventor",
        "2": "",
        "3": "",
        "4": "",
        "5": ""
      },
      "expansion": "its inventor",
      "name": "named-after/list"
    },
    {
      "args": {},
      "expansion": "|",
      "name": "!"
    },
    {
      "args": {
        "1": "en",
        "2": "David A. Huffman"
      },
      "expansion": "David A. Huffman",
      "name": "lang"
    },
    {
      "args": {
        "1": "en",
        "2": "David A. Huffman",
        "born": "1925",
        "died": "1999",
        "occ": "its inventor",
        "wplink": "="
      },
      "expansion": "Named after its inventor David A. Huffman (1925–1999)",
      "name": "named-after"
    }
  ],
  "etymology_text": "Named after its inventor David A. Huffman (1925–1999).",
  "forms": [
    {
      "form": "Huffman codings",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "Huffman coding (countable and uncountable, plural Huffman codings)",
      "name": "en-noun"
    }
  ],
  "hypernyms": [
    {
      "word": "prefix coding"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with quotations",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Theory of computing"
      ],
      "examples": [
        {
          "ref": "2018, Keshab K. Parhi, Takao Nishitami, editors, Digital Signal Processing for Multimedia Systems, CRC Press, →ISBN:",
          "text": "In Huffman coding, shorter code-words are assigned to more frequent symbols so that the average code-length is reduced.",
          "type": "quote"
        }
      ],
      "glosses": [
        "An entropy-encoding algorithm used for lossless data compression, involving a variable-length code table derived from the estimated probability of occurrence of each symbol (so that more frequent symbols take less space to store)."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "entropy",
          "entropy"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "lossless",
          "lossless"
        ],
        [
          "data compression",
          "data compression"
        ],
        [
          "code",
          "code"
        ],
        [
          "table",
          "table"
        ],
        [
          "probability",
          "probability"
        ]
      ],
      "raw_glosses": [
        "(computing theory) An entropy-encoding algorithm used for lossless data compression, involving a variable-length code table derived from the estimated probability of occurrence of each symbol (so that more frequent symbols take less space to store)."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "Huffman coding"
}